- random integers
- n.随机整数
English-Chinese dictionary of mining (英汉矿业大词典). 2013.
random integers
Look at other dictionaries:
Random walk — A random walk, sometimes denoted RW, is a mathematical formalization of a trajectory that consists of taking successive random steps. The results of random walk analysis have been applied to computer science, physics, ecology, economics and a… … Wikipedia
Random access machine — In computer science, random access machine (RAM) is an abstract machine in the general class of register machines. The RAM is very similar to the counter machine but with the added capability of indirect addressing of its registers. Like the… … Wikipedia
Algorithmically random sequence — Intuitively, an algorithmically random sequence (or random sequence) is an infinite sequence of binary digits that appears random to any algorithm. The definition applies equally well to sequences on any finite set of characters. Random sequences … Wikipedia
Park–Miller random number generator — The Park–Miller random number generator (or the Lehmer random number generator) is a variant of linear congruential generator that operates in multiplicative group of integers modulo n. A general formula of a random generator (RNG) of this type… … Wikipedia
discrete random variable — A random variable that can take only a certain specified set of individual possible values for example, the positive integers 1, 2, 3, . . . For example, stock prices are discrete random variables, because they can only take on certain values,… … Financial and business terms
Discrete random variable — A random variable that can take only a certain specified set of discrete possible values for example, the positive integers 1, 2, 3, . . . The New York Times Financial Glossary … Financial and business terms
Greatest common divisor — In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), or highest common factor (hcf), of two or more non zero integers, is the largest positive integer that divides the numbers without a remainder. For … Wikipedia
APL (programming language) — APL Paradigm(s) array, functional, structured, modular Appeared in 1964 Designed by Kenneth E. Iverson Developer Kenneth E. Iverson … Wikipedia
Fisher-Yates shuffle — The Fisher Yates shuffle, named after Ronald Fisher and Frank Yates, also known as the Knuth shuffle, after Donald Knuth, is an algorithm for generating a random permutation of a finite set in plain terms, for randomly shuffling the set. A… … Wikipedia
Cohen's cryptosystem — Cohen s cryptosystem[1] is a public key cryptosystem proposed in 1998 by Bram Cohen. Contents 1 Key generation 2 Encrypting a bit 3 De cryption … Wikipedia
Multiply-with-carry — In computer science, multiply with carry (MWC) is a method invented by George Marsaglia for generating sequences of random integers based on an initial set of from two to many thousands of randomly chosen seed values. The main advantages of the… … Wikipedia
